Latin Squares in a Cayley Table
نویسندگان
چکیده
Let G be a finite group of order n ≥ 2 and T be the Cayley table of G. Obviously T is a Latin square. In this paper we study submatrices of T which are Latin squares. Let Lm(G) where m ≤ n be the number of Latin squares of order m in T . We compute Lm(G) and study some properties of such submatrices. Also we classify the Latin squares of order m in T and compute the number of each classes in some cases. Mathematics Subject Classification: 20D60, 05D99
منابع مشابه
Small partial Latin squares that cannot be embedded in a Cayley table
We answer a question posed by Dénes and Keedwell that is equivalent to the following. For each order n what is the smallest size of a partial latin square that cannot be embedded into the Cayley table of any group of order n? We also solve some variants of this question and in each case classify the smallest examples that cannot be embedded. We close with a question about embedding of diagonal ...
متن کاملThe Open University ’ s repository of research publications and other research outputs Small Partial Latin Squares that Cannot be
We answer a question posed by Dénes and Keedwell that is equivalent to the following. For each order n what is the smallest size of a partial latin square that cannot be embedded into the Cayley table of any group of order n? We also solve some variants of this question and in each case classify the smallest examples that cannot be embedded. We close with a question about embedding of diagonal ...
متن کاملThe number of mates of latin squares of sizes 7 and 8∗
We study the number of mates that a latin square may possess as a function of the size of the square. We performed an exhaustive computer search of all squares of sizes 7 and 8, giving the exact value for the maximum number of mates for squares of these sizes. The squares of size 8 with the maximum number of mates are exactly the Cayley tables of Z2 = Z2×Z2×Z2, and each such square has 70, 272 ...
متن کاملDefining sets for Latin squares given that they are based on groups
We investigate defining sets for latin squares where we are given that the latin square is the Cayley table for some group. Our main result is that the proportion of entries in a smallest defining set approaches zero as the order of the group increases without bound.
متن کاملLatin squares: Equivalents and equivalence
This essay describes some mathematical structures ‘equivalent’ to Latin squares and some notions of ‘equivalence’ of such structures. According to the Handbook of Combinatorial Design [2], Theorem II.1.5, a Latin square of order n is equivalent to • the multiplication table (Cayley table) of a quasigroup on n elements; • a transversal design of index 1; • a (3,n)-net; • an orthogonal array of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006